Optimally Solving the Art Gallery Problem in Practice

نویسندگان

  • Davi Colli Tozoni
  • Pedro Jussieu de Rezende
  • Cid Carvalho de Souza
چکیده

The Art Gallery Problem (AGP) is a well studied NPhard problem in Computational Geometry. It consists of finding the minimum number of guards that are sufficient to visually cover a gallery, represented by a polygon. In our work, we designed and implemented a method that is capable of solving complex instances with up to 5000 vertices within only a few minutes. Also, we provide a complete version of our code and of our benchmark for download, which is unprecedented in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decentralized Approach to the Art Gallery Problem

With the increasing interest in ubiquitous computing and mobile robotics, distributed algorithms for solving computational geometry problems in a decentralized fashion will grow in importance. This paper describes a mapping of discretized variants of the art gallery problem to a distributed constraint optimization problem. A testbed using several complete, optimal, distributed algorithms is pre...

متن کامل

The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm

The general Art Gallery Problem (AGP) consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon. The AGP is a well known NP-hard problem and, for this reason, all algorithms proposed so far to solve it are unable to guarantee optimality except in especial cases. In this paper, we present a new method for solving the ...

متن کامل

On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Successive Approximations

We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. It is known that this is an NP-hard Art Gallery Problem with relevant practical applications. In this paper we present an approximation method that solves the problem by successive approximations, which we introduced in [21]. We report ...

متن کامل

The Catalogue of Canadian Art on CD-ROM at the National Gallery of Canada

As stated in its mission, "the strength of the National Gallery of Canada lies in its collection of art, especially Canadian art, and its accessibility to the public across the country." Founded in 1880, the National Gallery of Canada now includes over 42,000 objects of fine and decorative art, of which only a small proportion is shown either in permanent installations or temporary exhibitions....

متن کامل

The Inapproximability of Illuminating Polygons by α-Floodlights

We consider variants of the art gallery problem where guard visibility is limited to a certain angular aperture α. We show that the problem is NP-hard even when guards can be located in the interior of the polygon. We then proceed to prove that both this problem and its vertex variant, where guard placement is restricted to the vertices of the polygon, are APX-hard. We observe that earlier cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016